On the Complexity of the Boulinier et al's Unison Algorithm
نویسندگان
چکیده
In this paper, we address the unison problem. We consider the self-stabilizing algorithm proposed by Boulinier et al. We exhibit a bound on the step complexity of its stabilization time. In more details, the stabilization time of this algorithm is at most 2Dn + (α + 1)n + (α− 2D)n steps, where n is the number of processes, D is the diameter of the network, and α is a parameter of the algorithm.
منابع مشابه
Adaptive Subcarrier Assignment and Power Distribution in Multiuser OFDM Systems with Proportional Data Rate Requirement
A low complexity dynamic subcarrier and power allocation methodology for downlink communication in an OFDM-based multiuser environment is developed. The problem of maximizing overall capacity with constraints on total power consumption, bit error rate and data rate proportionality among users requiring different QOS specifications is formulated. Assuming perfect knowledge of the instantaneo...
متن کاملUnison as a Self-Stabilizing Wave Stream Algorithm in Asynchronous Anonymous Networks
How to pass from local to global scales in anonymous networks? In such networks, how to organize a self-stabilizing propagation of information with feedback? From Angluin’s results, the deterministic leader election is impossible in general anonymous networks. Thus, it is impossible to build a rooted spanning tree. In this paper we show how to use Unison to design a selfstabilizing barrier sync...
متن کاملAn Algorithm to Compute the Complexity of a Static Production Planning (RESEARCH NOTE)
Complexity is one of the most important issues of any production planning. The increase in complexity of production planning can cause inconsistency between a production plan and an actual outcome. The complexity generally can be divided in two categories, the static complexity and the dynamic complexity, which can be computed using the ant ropy formula. The formula considers the probability of...
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملON FUZZY NEIGHBORHOOD BASED CLUSTERING ALGORITHM WITH LOW COMPLEXITY
The main purpose of this paper is to achieve improvement in thespeed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basisfor fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP(NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJPalgorithm would an important achievement in terms of these FJP-based meth-ods. Although FJP has many advantages such as r...
متن کامل